The extended Cantor-Bendixson analysis of trees
نویسنده
چکیده
The Hausdorff analysis of chains is an instance of the Cantor-Bendixson analysis of topological spaces. Using the methods of point-free topology I obtain a considerable extension of Hausdorff’s methods applicable to all trees.
منابع مشابه
The Cantor-Bendixson Analysis of Finite Trees
We present a measure on the structural complexity of finite and infinite trees and provide some first result on its relation to contextfree grammars and context-free tree grammars. In particular this measure establishes a relation between the complexity of a language as a set, and the complexity of the objects it contains. We show its precise nature and prove its decidability for the formalisms...
متن کاملOn the Cantor-bendixson Rank of Metabelian Groups
We study the Cantor-Bendixson rank of metabelian and virtually metabelian groups in the space of marked groups, and in particular, we exhibit a sequence (Gn) of 2-generated, finitely presented, virtually metabelian groups of Cantor-Bendixson ωn.
متن کاملModel-theoretic complexity of automatic structures
We study the complexity of automatic structures via well-established concepts from both logic and model theory, including ordinal heights (of well-founded relations), Scott ranks of structures, and Cantor-Bendixson ranks (of trees). We prove the following results: 1) The ordinal height of any automatic wellfounded partial order is bounded by ω; 2) The ordinal heights of automatic well-founded r...
متن کاملCdmtcs Research Report Series Eective Presentability of Boolean Algebras of Cantor{bendixson Rank 1 Eective Presentability of Boolean Algebras of Cantor{bendixson Rank 1
We show that there is a computable Boolean algebra B and a computably enumerable ideal I of B such that the quotient algebra B=I is of Cantor{Bendixson rank 1 and is not isomorphic to any computable Boolean algebra. This extends a result of L. Feiner and is deduced from Feiner's result even though Feiner's construction yields a Boolean algebra of in nite Cantor{Bendixson rank.
متن کاملModel Theoretic Complexity of Automatic Structures (Extended Abstract)
We study the complexity of automatic structures via wellestablished concepts from both logic and model theory, including ordinal heights (of well-founded relations), Scott ranks of structures, and CantorBendixson ranks (of trees). We prove the following results: 1) The ordinal height of any automatic well-founded partial order is bounded by ω; 2) The ordinal heights of automatic well-founded re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005